Coalition structure generation: A survey
نویسندگان
چکیده
Article history: Received 3 October 2014 Received in revised form 30 July 2015 Accepted 13 August 2015 Available online 21 August 2015
منابع مشابه
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent systems. However, one of the main problems that hinders the wide spread adoption of coalition formation technologies is the computational complexity of coalition structure generation. That is, once a group of agents has bee...
متن کاملCoalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a characteristic function form of the coalition values, where a coalition’s value is independent of the other coalitions in the coalition structure. Recently, there has been interest in the more realistic partition functio...
متن کاملA best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition values, while existing algorithms base their generation on the structure (members and configurations) of coalitions. With our algorithm, coalition structures are generated by repeatedly choosing the best coalition, as de...
متن کاملCoalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the value of a coalition depends on the tasks its members can achieve. The tasks require various skills to complete them, and agents may have different skill sets. The optimal coalition structure is a partition of the agents t...
متن کاملCoalition structure generation with the graphics processing unit
Coalition Structure Generation—the problem of finding the optimal division of agents into coalitions—has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP [17], which is a hybrid of two previous algorithms, namely IDP and IP. Given this, it is desirable to speed up IDP as this will, in turn, improve upon the state-of-the-art. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 229 شماره
صفحات -
تاریخ انتشار 2015